package com.dong.dynamicProgramming;

/**
 * @author dcz
 * @classname Demo7
 * @description 不同结构的二叉搜索树
 * @date 2022/4/25 9:41
 */
public class Demo7 {
    public int numTrees(int n) {
        int[] dp = new int[n+1];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            for (int j = 1;  j <= i; j++) {
                dp[i] += dp[j-1] * dp[i-j];
            }
        }
        return dp[n];


    }
}
